Bipartite Polar Classification for Surface Reconstruction
نویسندگان
چکیده
منابع مشابه
Bipartite Polar Classification for Surface Reconstruction
In this paper, we propose bipartite polar classification to augment an input unorganized point set P with two disjoint groups of points distributed around the ambient space of P to assist the task of surface reconstruction. The goal of bipartite polar classification is to obtain a space partitioning of P by assigning pairs of Voronoi poles into two mutually invisible sets lying in the opposite ...
متن کاملImplicit Surface Reconstruction with an Analogy of Polar Field Model
Implicit surface reconstruction has been a challenging work for decades. In this paper, motivated by the concept of classic physical polar field model and off-set points strategy, we present a new approach, called Field Fitting. In this approach, we express a 3D surface as an equipotential surface of scalar polar field which is produced by a number of paired field generating primitives, then a ...
متن کاملSurface reconstruction of detect contours for medical image registration purpose
Although, most of the abnormal structures of human brain do not alter the shape of outer envelope of brain (surface), some abnormalities can deform the surface extensively. However, this may be a major problem in a surface-based registration technique, since two nearly identical surfaces are required for surface fitting process. A type of verification known as the circularity check for th...
متن کاملClustering for Surface Reconstruction
We consider applications of clustering techniques, Mean Shift and Self-Organizing Maps, to surface reconstruction (meshing) from scattered point data and review a novel kernel-based clustering method.
متن کاملRecognizing line-polar bipartite graphs in time O(n)
A graph is polar if the vertex set can be partitioned into A and B in such a way that A induces a complete multipartite graph and B induces a disjoint union of cliques (i.e., the complement of a complete multipartite graph). Polar graphs naturally generalize several classes of graphs such as bipartite graphs, cobipartite graphs and split graphs. Recognizing polar graphs is an NP-complete proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2011
ISSN: 0167-7055
DOI: 10.1111/j.1467-8659.2011.02039.x